Large and moderate deviations for matching problems and empirical discrepancies
نویسندگان
چکیده
We study the two-sample matching problem and its connections with the Monge-Kantorovich problem of optimal transportation of mass. We exploit this connection to obtain moderate and large deviation principles. For the classical problem on the unit square we present a conjecture which, if true, yields an explicit formula for the rate function.
منابع مشابه
Asymptotic equivalence of empirical likelihood and Bayesian MAP
In this paper we are interested in empirical likelihood (EL) as a method of estimation, and we address the following two problems: (1) selecting among various empirical discrepancies in an EL framework and (2) demonstrating that EL has a well-defined probabilistic interpretation that would justify its use in a Bayesian context. Using the large deviations approach, a Bayesian law of large number...
متن کاملConditional large and moderate deviations for sums of discrete random variables. Combinatoric applications
We prove large and moderate deviation principles for the distribution of an empirical mean conditioned by the value of the sum of discrete i.i.d. random variables. Some applications for combinatoric problems are discussed.
متن کاملConditional large and moderate deviations for sums of discrete random variables
We prove large and moderate deviation principles for the distribution of an empirical mean conditioned by the value of the sum of discrete i.i.d. random variables. Some applications for combinatoric problems are discussed.
متن کاملDelta Method in Large Deviations and Moderate Deviations for Estimators by Fuqing
The delta method is a popular and elementary tool for deriving limiting distributions of transformed statistics, while applications of asymptotic distributions do not allow one to obtain desirable accuracy of approximation for tail probabilities. The large and moderate deviation theory can achieve this goal. Motivated by the delta method in weak convergence, a general delta method in large devi...
متن کاملHeuristic approach to solve hybrid flow shop scheduling problem with unrelated parallel machines
In hybrid flow shop scheduling problem (HFS) with unrelated parallel machines, a set of n jobs are processed on k machines. A mixed integer linear programming (MILP) model for the HFS scheduling problems with unrelated parallel machines has been proposed to minimize the maximum completion time (makespan). Since the problem is shown to be NP-complete, it is necessary to use heuristic methods to ...
متن کامل